Braess paradox in a quantum network

Braess, while working on traffic modeling, noticed that flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider quantum network, where represent shared entangled states between spatially separated parties (nodes). The goal entangle two previously uncorrelated nodes using entanglement swappings. amount of distant quantified average concurrence established, result then introduce additional edge maximally Bell show introduction this leads lower nodes. Thus we demonstrate occurrence analogous paradox networks.